Triangular Sets for Solving Polynomial Systems : aComparison of Four
نویسندگان
چکیده
r esum e Quatre m ethodes de r esolution de syst emes d' equations polynomiales sont pr esent ees et implant ees dans un cadre commun. Ces m ethodes sont celles de Wu ((Wu87]), Lazard ((Laz91]), Kalkbrener ((Kal91]) et Wang ((Wan93b]). Elles sont compar ees sur divers exemples avec une attention par-ticuli ere port ee a l'eecacit e, la concision et la lisibilit e des sorties. Abstract Four methods for solving polynomial systems by means of triangular sets are presented and implemented in a uniied way. These methods are those of Wu ((Wu87]), Lazard ((Laz91]), Kalkbrener ((Kal91]) and Wang ((Wan93b]). They are compared on various examples with emphasizing on eeciency, conciseness and legibility of the outputs.
منابع مشابه
Resolution of Fuzzy Complex Systems of Linear Equations Via Wu's Method
The aim of this paper is to present algebraic method which is called Wu's method to solving fuzzy complex systems of linear equations. Wu's method is used as a solution procedure for solving the crisp polynomial equations system. This algorithm leads to solving characteristic sets that are amenable to easy solution. To illustrate the easy application of the proposed method, numerical examples a...
متن کاملComputational Methods
[4] Philippe Aubry and Marc Moreno Maza, Triangular sets for solving polynomial systems: A comparative implementation of four methods, Computing restrictions of ideals in finitely generated k-algebras by means of Buchberger's algorithm,
متن کاملOn the Theories of Triangular Sets
Triangular sets appear under various names in many papers concerning systems of polynomial equations. Ritt (1932) introduced them as characteristic sets. He described also an algorithm for solving polynomial systems by computing characteristic sets of prime ideals and factorizing in field extensions. Characteristic sets of prime ideals have good properties but factorization in algebraic extensi...
متن کاملAn interval-valued programming approach to matrix games with payoffs of triangular intuitionistic fuzzy numbers
The purpose of this paper is to develop a methodology for solving a new type of matrix games in which payoffs are expressed with triangular intuitionistic fuzzy numbers (TIFNs). In this methodology, the concept of solutions for matrix games with payoffs of TIFNs is introduced. A pair of auxiliary intuitionistic fuzzy programming models for players are established to determine optimal strategies...
متن کاملEfficient Characteristic Set Algorithms for Equation Solving in Finite Fields and Applications in Cryptanalysis
Efficient characteristic set methods for computing solutions of polynomial equation systems in a finite field are proposed. The concept of proper triangular sets is introduced and an explicit formula for the number of solutions of a proper and monic (or regular) triangular set is given. An improved zero decomposition algorithm which can be used to reduce the zero set of an equation system in ge...
متن کامل